منابع مشابه
Breaking DES
John Gilmore of the Electronic Frontier Foundation (EFF) and I had several discussions in early 1997 about actually building such a machine. Approaches using FPGAs, microprocessor arrays, and networks of low-cost PCs were prohibitively expensive, but our projections showed that low-volume ASIC fabrication processes were well-suited to the task. John then arranged $250,000 in financing for the p...
متن کاملBreaking DES using a molecular computer
Recently Adleman has shown that a small traveling salesman problem can be solved by molecular operations. In this paper we show how the same principles can be applied to breaking the Data Encryption Standard (DES). We describe in detail a library of operations which are useful when working with a molecular computer. We estimate that given one arbitrary (plain-text, cipher-text) pair, one can re...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملSe p 19 93 R Symmetry Breaking Versus Supersymmetry Breaking
We point out a connection between R symmetry and supersymmetry breaking. We show that the existence of an R symmetry is a necessary condition for supersymmetry breaking and a spontaneously broken R symmetry is a sufficient condition provided two conditions are satisfied. These conditions are: genericity, i.e. the effective Lagrangian is a generic Lagrangian consistent with the symmetries of the...
متن کاملMaximum Search Using P Systems
Several algorithms of maximum search are investigated and evaluated in different types of P systems, namely using priorities, multiple nested membranes and linked transport. The proposed solutions are expected to find application in a wide range of problems. In particular, the authors are currently working on modeling an algorithm for DNA sequence alignment using P systems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00531-5